Alignment methods for biased multicanonical sampling
نویسندگان
چکیده
منابع مشابه
Alignment methods for biased multicanonical sampling.
The efficiency of the multicanonical procedure can be significantly improved by applying an additional bias to the numerically generated sample space. However, results obtained by biasing in different sampling regions cannot in general be accurately combined, since their relative normalization coefficient is not known precisely. We demonstrate that for overlapping biasing regions a simple itera...
متن کاملMulticanonical MCMC for sampling rare events: an illustrative review
Multicanonical MCMC (Multicanonical Markov Chain Monte Carlo; Multicanonical Monte Carlo) is discussed as a method of rare event sampling. Starting from a review of the generic framework of importance sampling, multicanonical MCMC is introduced, followed by applications in random matrices, random graphs, and chaotic dynamical systems. Replica exchange MCMC (also known as parallel tempering or M...
متن کاملislanding detection methods for microgrids
امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...
15 صفحه اولTemporally-Biased Sampling for Online Model Management
To maintain the accuracy of supervised learning models in the presence of evolving data streams, we provide temporally-biased sampling schemes that weight recent data most heavily, with inclusion probabilities for a given data item decaying exponentially over time. We then periodically retrain the models on the current sample. This approach speeds up the training process relative to training on...
متن کاملSearching for Rare Growth Factors Using Multicanonical Monte Carlo Methods
The growth factor of a matrix quantifies the amount of potential error growth possible when a linear system is solved using Gaussian elimination with row pivoting. While it is an easy matter [N. J. Higham and D. J. Higham, SIAM J. Matrix Anal. Appl., 10 (1989), pp. 155–164] to construct examples of n × n matrices having any growth factor up to the maximum of 2n−1, the weight of experience and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Optical Society of America A
سال: 2007
ISSN: 1084-7529,1520-8532
DOI: 10.1364/josaa.24.002474